Arnold’s Piecewise Linear Filtrations, Analogues of Stanley–Reisner Rings and Simplicial Newton Polyhedra
نویسندگان
چکیده
In 1974, the author proved that codimension of ideal (g1,g2,…,gd) generated in group algebra K[Zd] over a field K characteristic 0 by generic Laurent polynomials having same Newton polytope Γ is equal to d!×Volume(Γ). Assuming Newtons simplicial and super-convenient (that is, containing some neighborhood origin), strengthens 1974 result explicitly specifying set Bsh monomials cardinality d!×Volume(Γ), whose equivalence classes form basis quotient K[Zd]/(g1,g2,…,gd). The constructed inductively from any shelling sh Γ. Using structure, we prove associated graded -algebra grΓ(K[Zd]) Arnold–Newton filtration has Cohen–Macaulay property. This proof generalization B. Kind P. Kleinschmitt’s 1979 Stanley–Reisner rings complexes admitting are Cohen–Macaulay. Finally, for (f1,f2,…,fd) with Γ, defines monomial
منابع مشابه
Newton Polyhedra and Factorial Rings
be a Laurent polynomial over a field k. The convex hull of the set {(ii,. . . , i,)~ Z” : a i,...i. f 0) in R” is called the Newton polyhedron of F and will be denoted by 4~. Following Hovanskii [S] we say that F is nondegenerate if for any face d’ of AF the hypersurface C~i,...,.in)Ed,Ui,...i,Xill * * * xi = 0 is non-singular in F*” (Eis the algebraic closure of the field k). The main result o...
متن کاملFiltrations in Semisimple Rings
In this paper, we describe the maximal bounded Z-filtrations of Artinian semisimple rings. These turn out to be the filtrations associated to finite Z-gradings. We also consider simple Artinian rings with involution, in characteristic 6= 2, and we determine those bounded Z-filtrations that are maximal subject to being stable under the action of the involution. Finally, we briefly discuss the an...
متن کاملVertex-Unfoldings of Simplicial Polyhedra
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected interior: the triangles are connected at vertices, but not necessarily joined along edges.
متن کاملEvaluation Algorithm for a Decomposed Simplicial Piecewise- Linear Formulation
In this work an algorithm for the evaluation of N-dimensional piecewise-linear (PWL) functions is presented. The type of PWL representation which is considered is the denominated simplicial representation that is defined in a N-dimensional domain partitioned by hyperplanes and divided into simplices. The algorithm performs a local function computation into the specific simplex where the evaluat...
متن کاملNewton Polyhedra (algebra and Geometry)
1.1. The ideology of general position. Suppose that the outcome of some natural process, such as a physical experiment, is the graph of a function of one variable over a closed interval of finite length. One feels that such a function ought to have only finitely many roots. Can this be proved rigorously? “Classical mathematics” answers this question with an univocal “no”: for any given closed s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10234445